Traveling time and traveling length in critical percolation clusters.

نویسندگان

  • Y Lee
  • J S Andrade
  • S V Buldyrev
  • N V Dokholyan
  • S Havlin
  • P R King
  • G Paul
  • H E Stanley
چکیده

We study traveling time and traveling length for tracer dispersion in two-dimensional bond percolation, modeling flow by tracer particles driven by a pressure difference between two points separated by Euclidean distance r. We find that the minimal traveling time t(min) scales as t(min) approximately r(1.33), which is different from the scaling of the most probable traveling time, t* approximately r(1.64). We also calculate the length of the path corresponding to the minimal traveling time and find l(min) approximately r(1.13) and that the most probable traveling length scales as l* approximately r(1.21). We present the relevant distribution functions and scaling relations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traveling length and minimal traveling time for flow through percolation networks with long-range spatial correlations.

We study the distributions of traveling length l and minimal traveling time t(min) through two-dimensional percolation porous media characterized by long-range spatial correlations. We model the dynamics of fluid displacement by the convective movement of tracer particles driven by a pressure difference between two fixed sites ("wells") separated by Euclidean distance r. For strongly correlated...

متن کامل

Efficient Solution Procedure to Develop Maximal Covering Location Problem Under Uncertainty (Using GA and Simulation)

  In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...

متن کامل

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

متن کامل

Postbreakthrough behavior in flow through porous media.

We numerically simulate the traveling time of a tracer in convective flow between two points (injection and extraction) separated by a distance r in a model of porous media, d=2 percolation. We calculate and analyze the traveling time probability density function for two values of the fraction of connecting bonds p: the homogeneous case p=1 and the inhomogeneous critical threshold case p=p(c). ...

متن کامل

The Stiffness Variation of a Micro-Ring Driven by a Traveling Piecewise-Electrode

In the practice of electrostatically actuated micro devices; the electrostatic force is implemented by sequentially actuated piecewise-electrodes which result in a traveling distributed electrostatic force. However; such force was modeled as a traveling concentrated electrostatic force in literatures. This article; for the first time; presents an analytical study on the stiffness variation of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

دوره 60 3  شماره 

صفحات  -

تاریخ انتشار 1999